The breadth of memory search.
نویسنده
چکیده
The recall of previously studied items is widely believed to incorporate a search of a markedly constrained set of possibilities, and the present study examines whether this set of items typically includes unstudied semantic associates of the study items. In an episodic task, participants recalled a previously studied list of eight exemplars drawn from a small or large category, and, in a semantic task, participants generated exemplars from these categories. Category size affected the time course of recall in the semantic task but not in the episodic task. This empirical dissociation between episodic and semantic memory is consistent with the view that episodic memory search efficiently excludes unstudied semantic associates of the study items and is instead constrained to those items sharing the temporal and spatial attributes of the episode.
منابع مشابه
A Breadth-First Approach to Memory-Efficient Graph Search
Recent work shows that the memory requirements of A* and related graph-search algorithms can be reduced substantially by only storing nodes that are on or near the search frontier, using special techniques to prevent node regeneration, and recovering the solution path by a divide-and-conquer technique. When this approach is used to solve graph-search problems with unit edge costs, we have shown...
متن کاملParallel Breadth-First Heuristic Search on a Shared-Memory Architecture
We consider a breadth-first approach to memory-efficient graph search and discuss how to parallelize it on a sharedmemory architecture that uses multithreading to achieve parallelism. The approach we develop for parallelizing breadthfirst search uses layer synchronization, in which threads expand all nodes in one layer of the breadth-first search graph before considering any nodes in the next l...
متن کاملBreadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کاملCompression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
For parallel breadth first search (BFS) algorithm on large-scale distributed memory systems, communication often costs significantly more than arithmetic and limits the scalability of the algorithm. In this paper we sufficiently reduce the communication cost in distributed BFS by compressing and sieving the messages. First, we leverage a bitmap compression algorithm to reduce the size of messag...
متن کاملA Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination
This note recapitulates an algorithmic observation for ordered Depth-First Search (DFS) in directed graphs that immediately leads to a parallel algorithm with linear speed-up for a range of processors for non-sparse graphs. The note extends the approach to ordered Breadth-First Search (BFS). With p processors, both DFS and BFS algorithms run in O(m/p + n) time steps on a shared-memory parallel ...
متن کاملImproving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search
Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A* search. In this paper, we improve the scalability of this approach by developing a memoryefficient heuristic search algorithm for learning the structure of a Bayesian network. Instead of using A*, we propose a fronti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Memory
دوره 10 4 شماره
صفحات -
تاریخ انتشار 2002